The k-Median Problem for Directed Trees
نویسندگان
چکیده
منابع مشابه
A method for analyzing the problem of determining the maximum common fragments of temporal directed tree, that do not change with time
In this study two actual types of problems are considered and solved: 1) determining the maximum common connected fragment of the T-tree (T-directed tree) which does not change with time; 2) determining all maximum common connected fragments of the T-tree (T-directed tree) which do not change with time. The choice of the primary study of temporal directed trees and trees is justified by the wid...
متن کاملAn algorithm for finding a k-median in a directed tree
We consider the problem of finding a k-median in a directed tree. We present an algorithm that computes a k-median in O(Pk) time where k is the number of resources to be placed and P is the path length of the tree. In the case of a balanced tree, this implies O(kn log n) time, in a random tree O(k2n3/2), while in the worst case O(kn). Our method employs dynamic programming and uses O(nk) space,...
متن کاملOn the K shortest path trees problem
We address the problem for finding the K best path trees connecting a source node with any other non-source node in a directed network with arbitrary lengths. The main result in this paper is the proof that the kth shortest path tree is adjacent to at least one of the previous (k−1) shortest path trees. Consequently, we design an O(+Km) time and O(K+m) space algorithm to determine the K shortes...
متن کاملThe K-median Problem on a Tree
The polyhedral structure of the K-median problem on a tree is examined. Even for very small connected graphs, we show that additional constraints are needed to describe the integer polytope. We completely characterize those trees for which an optimal integer LP solution is guaranteed to exist. Also, a new and simpler proof of the worst case bound of an LP solution is provided. We find a new cla...
متن کاملShortest paths in mixed graphs and nearly conservative digraphs
Finding shortest paths in mixed graphs is NP-hard even when the weighting is conservative. We give an FPT algorithm for this problem, where the parameter k is the number of “negative trees”. We may always assume that the undirected edges have negative weights, and in a conservative weighting they form some trees – these trees are called the negative trees. Our algorithm extends to mixed graphs ...
متن کامل